Formalizing Metarouting in PVS

In this paper, we extend PVS specification logic with abstract metarouting theory to aid the development of complex routing protocol models based on metarouting, which is an algebraic framework for specifying routing protocols in a restricted fashion such that the protocol is guaranteed to converge. Our formalization of metarouting theory utilizes the theory-interpretation extensions of PVS. Our use of a general purpose theorem prover provides a structured framework for a network designer to incrementally develop and refine their algebraic routing protocol model by starting from various base routing algebras, and composing them into complex algebra models with composition operators. In addition, one can leverage PVS’s type checking capability and built-in proof engine to ensure routing model consistency.